Submodular Risk Allocation

نویسندگان

  • Samim Ghamami
  • Paul Glasserman
چکیده

We analyze the optimal allocation of trades to portfolios when the cost associated with an allocation is proportional to each portfolio’s risk. Our investigation is motivated by changes in the over-the-counter derivatives markets, under which some contracts may be traded bilaterally or through central counterparties, splitting a set of trades into two or more portfolios. A derivatives dealer faces risk-based collateral and capital costs for each portfolio, and it seeks to minimize total margin requirements through its allocation of trades to portfolios. When margin requirements are submodular, the problem becomes a submodular intersection problem. Its dual provides per-trade margin attributions, and assigning trades to portfolios based on the lowest attributed costs yields an optimal allocation. As part of this investigation, we derive conditions under which standard deviation and other risk measures are submodular functions of sets of trades. We compare systemwide optimality with individually optimal allocations in a market with multiple dealers. JEL Codes: G10, G21, C60, C71.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mixed Robust/Average Submodular Partitioning

We investigate two novel mixed robust/average-case submodular data partitioning problems that we collectively call Submodular Partitioning. These problems generalize purely robust instances of the problem, namely max-min submodular fair allocation (SFA) [8] and min-max submodular load balancing (SLB) [15], and also average-case instances, that is the submodular welfare problem (SWP) [16] and su...

متن کامل

On Competitiveness in Uniform Utility Allocation Markets

We call a market competitive if increasing the endowment of one buyer does not increase the equilibrium utility of another. We show every competitive uniform utility allocation market is a submodular utility allocation market, answering a question of Jain and Vazirani, (2007). Our proof proceeds via characterizing non-submodular fractionally sub-additive functions.

متن کامل

Multi-Agent Combinatorial Optimization under Submodular Functions

Submodular functions are the discrete ananlogue of convexity and generalize many known and well studied settings. They capture several economic principles such as decreasing marginal cost and correlated utilities. Multi-agent allocation problems over submodular functions arise in a variety of natural scenarios and have been the subject of extensive study over the last decade. In this proposal I...

متن کامل

Robust Budget Allocation via Continuous Submodular Functions

The optimal allocation of resources for maximizing influence, spread of information or coverage, has gained attention in the past years, in particular in machine learning and data mining. But in applications, the parameters of the problem are rarely known exactly, and using wrong parameters can lead to undesirable outcomes. We hence revisit a continuous version of the Budget Allocation or Bipar...

متن کامل

Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture

We consider the Minimum Submodular Cost Allocation (MSCA) problem [3]. In this problem, we are given k submodular cost functions f1, . . . , fk : 2 → R+ and the goal is to partition V into k sets A1, . . . , Ak so as to minimize the total cost ∑k i=1 fi(Ai). We show that MSCA is inapproximable within any multiplicative factor even in very restricted settings; prior to our work, only Set Cover h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017